A ug 2 00 6 Random walk on graphs with regular resistance and volume growth ∗
نویسنده
چکیده
In this paper characterizations of graphs satisfying heat kernel estimates for a wide class of space-time scaling functions are given. The equivalence of the two-sided heat kernel estimate and the parabolic Harnack inequality is also shown via the equivalence of the upper (lower) heat kernel estimate to the parabolic mean value (and super mean value) inequality.
منابع مشابه
A ug 2 00 5 RAINBOW HAMILTON CYCLES IN RANDOM REGULAR GRAPHS SVANTE JANSON
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n → ∞, provided d ≥ 8.
متن کاملA ug 2 00 5 RAINBOW HAMILTON CYCLES IN RANDOM REGULAR GRAPHS
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n → ∞, provided d ≥ 8.
متن کاملThe mass of sites visited by a random walk on an infinite graph
We determine the log-asymptotic decay rate of the negative exponential moments of the mass of sites visited by a random walk on an infinite graph which satisfies a two-sided sub-Gaussian estimate on its transition kernel. This provides a new method of proof of the correct decay rate for Cayley graphs of finitely generated groups with polynomial volume growth. This method also extend known resul...
متن کاملSharp Bounds on Random Walk Eigenvalues via Spectral Embedding
Spectral embedding of graphs uses the top k eigenvectors of the random walk matrix to embed the graph into Rk. The primary use of this embedding has been for practical spectral clustering algorithms [SM00, NJW01]. Recently, spectral embedding was studied from a theoretical perspective to prove higher order variants of Cheeger’s inequality [LOT12, LRTV12]. We use spectral embedding to provide a ...
متن کاملThe Einstein relation for random walks on graphs
This paper investigates the Einstein relation; the connection between the volume growth, the resistance growth and the expected time a random walk needs to leave a ball on a weighted graph. The Einstein relation is proved under different set of conditions. In the simplest case it is shown under the volume doubling and time comparison principles. This and the other set of conditions provide the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008